Disjunctive cuts for cross-sections of the second-order cone
نویسندگان
چکیده
In this paper we provide a unified treatment of general two-term disjunctions on crosssections of the second-order cone. We derive a closed-form expression for a convex inequality that is valid for such a disjunctive set and show that this inequality is sufficient to characterize the closed convex hull of all two-term disjunctions on ellipsoids and paraboloids, and split disjunctions on all cross-sections of the second-order cone. Our approach extends the work of Kılınç-Karzan and Yıldız on general two-term disjunctions for the second-order cone.
منابع مشابه
Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization
We investigate the derivation of disjunctive conic cuts for mixed integer second order cone optimization (MISOCO). These conic cuts characterize the convex hull of the intersection of a disjunctive set and the feasible set of a MISOCO problem. We present a full characterization of these inequalities when the disjunctive set considered is defined by parallel hyperplanes.
متن کاملA conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
We study the convex hull of the intersection of a convex set E and a disjunctive set. This intersection is at the core of solution techniques for Mixed Integer Convex Optimization. We prove that if there exists a cone K (resp., a cylinder C) that has the same intersection with the boundary of the disjunction as E , then the convex hull is the intersection of E with K (resp., C). The existence o...
متن کاملA complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
We study the convex hull of the intersection of a disjunctive set defined by parallel hyperplanes and the feasible set of a mixed integer second order cone optimization (MISOCO) problem. We extend our prior work on disjunctive conic cuts (DCCs), which has thus far been restricted to the case in which the intersection of the hyperplanes and the feasible set is bounded. Using a similar technique,...
متن کاملTwo-Term Disjunctions on the Second-Order Cone
Balas introduced disjunctive cuts in the 1970s for mixed-integer linear programs. Several recent papers have attempted to extend this work to mixedinteger conic programs. In this paper we study the structure of the convex hull of a two-term disjunction applied to the second-order cone, and develop a methodology to derive closed-form expressions for convex inequalities describing the resulting c...
متن کاملMixed integer programming with a class of nonlinear convex constraints
We study solution approaches to a class of mixed-integer nonlinear programming problems that arise from recent developments in risk-averse stochastic optimization and contain second-order and p-order cone programming as special cases. We explore possible applications of some of the solution techniques that have been successfully used in mixed-integer conic programming and show how they can be g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015